Omer Reingold

#	Item
21	When and How Can Data be Efficiently Released with Privacy? Cynthia Dwork Moni Naor∗ Omer Reingold Salil Vadhan Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-11-01 14:13:39 Data privacy Applied probability Exponential mechanism Time complexity Differential privacy Constructible universe Polynomial Negligible function PP Theoretical computer science Mathematics Computational complexity theory
22	Eﬃciency Improvements in Constructing Pseudorandom Generators from One-way Functions∗ Iftach Haitner† and Omer Reingold‡ and Salil Vadhan§ May 24, 2012 Abstract Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2013-11-27 11:40:21 Randomness Pseudorandomness Information theory Computational complexity theory Pseudorandom number generators Pseudorandom generator Leftover hash lemma Entropy Fortuna Theoretical computer science Applied mathematics Cryptography
23	2009 Godel Prize The 2009 G¨odel Prize for outstanding papers in the area of theoretical computer Add to Reading List Source URL: www.eatcs.org Language: English - Date: 2009-11-03 08:49:42 Salil Vadhan Zig-zag product Expander graph Omer Reingold Avi Wigderson Gödel Prize SL Connectivity Graph Graph theory Theoretical computer science Mathematics